. C O ] 1 2 Ju l 2 00 5 AUTOMATIC ENUMERATION OF REGULAR OBJECTS

نویسنده

  • MARNI MISHNA
چکیده

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These differential equations are then used to determine the initial counting sequence and for asymptotic analysis. The key tool is the scalar product for symmetric functions and that this operation preserves D-finiteness.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 10 70 26 v 1 2 6 Ju l 2 00 1 Combinatorial identities for binary necklaces from exact ray - splitting trace formulae

Based on an exact trace formula for a one-dimensional ray-splitting system, we derive novel combinatorial identities for cyclic binary sequences (Pólya necklaces).

متن کامل

ar X iv : c s . L O / 0 20 70 86 v 1 2 5 Ju l 2 00 2 A Model - Theoretic Semantics for Defeasible Logic ⋆

Defeasible logic is an efficient logic for defeasible reasoning. It is defined through a proof theory and, until now, has had no model theory. In this paper a model-theoretic semantics is given for defeasible logic. The logic is sound and complete with respect to the semantics. We also briefly outline how this approach extends to a wide range of defeasible logics.

متن کامل

Herbicide Interchange between a Stream and the Adjacent Alluvial Aquifer.

published in Aduance ACS Abstracts, October 1,1994. 2344 Environ. Scl. Technol., Vol. 28, No. 13, 1994 D ow nl oa de d by U N IV O F N E B R A SK A L IN C O L N o n Ju ly 1 0, 2 00 9

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009